منابع مشابه
Anti-Path Cover on Sparse Graph Classes
Graph Hamiltonian properties are studied especially in connection with graph connectivity properties. A graph is called Hamiltonian if there is a path passing through all its vertices in that graph. In this work we are interested in sparse graph setting for which this question was already solved e.g. using the famous theorem of Courcelle [4]. It is possible to express the Hamiltonian property b...
متن کاملOn Ultralimits of Sparse Graph Classes
The notion of nowhere denseness is one of the central concepts of the recently developed theory of sparse graphs. We study the properties of nowhere dense graph classes by investigating appropriate limit objects defined using the ultraproduct construction. Our goal is to demonstrate that different equivalent definitions of nowhere denseness, for example via quasi-wideness or the splitter game, ...
متن کاملOn the k-path vertex cover of some graph products
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. In this paper improved lower and upper bounds for ψk of the Cartesian and the direct product of paths are derived. It is shown that for ψ3 those bounds are tight. For the lexicographic produc...
متن کاملKernelization Using Structural Parameters on Sparse Graph Classes
Meta-theorems for polynomial (linear) kernels have been the subject of intensive research in parameterized complexity. Heretofore, there were meta-theorems for linear kernels on graphs of bounded genus, H-minor-free graphs, and H-topological-minor-free graphs. To the best of our knowledge, there are no known meta-theorems for kernels for any of the larger sparse graph classes: graphs of bounded...
متن کاملClique Cover on Sparse Networks
We consider the problem of edge clique cover on sparse networks and study an application to the identification of overlapping protein complexes for a network of binary protein-protein interactions. We first give an algorithm whose running time is linear in the size of the graph, provided the treewidth is bounded. We then provide an algorithm for planar graphs with bounded branchwidth upon which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2016
ISSN: 2075-2180
DOI: 10.4204/eptcs.233.8